Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
نویسندگان
چکیده
منابع مشابه
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
In phylogenetics, a central problem is to infer the evolutionary relationships between a set of species X; these relationships are often depicted via a phylogenetic tree-a tree having its leaves labeled bijectively by elements of X and without degree-2 nodes-called the "species tree." One common approach for reconstructing a species tree consists in first constructing several phylogenetic trees...
متن کاملCompatibility of unrooted phylogenetic trees is FPT
A collection of T1, T2, . . . , Tk of unrooted, leaf labelled (phylogenetic) trees, all with different leaf sets, is said to be compatible if there exists a tree T such that each tree Ti can be obtained from T by deleting leaves and contracting edges. Determining compatibility is NP-hard, and the fastest algorithm to date has worst case complexity of around (nk) time, n being the number of leav...
متن کاملThe agreement problem for unrooted phylogenetic trees is FPT
A collection T of k unrooted phylogenetic trees on different leaf sets is said to be strictly compatible or in agreement if there exists a tree T such that each tree in T can be obtained from T by deleting leaves and suppressing degree-2 vertices. The problem of determining if a set of unrooted trees is in agreement has been proved NP-hard in 1992. Here, we show that an f(k) · n algorithm exist...
متن کاملGraph triangulations and the compatibility of unrooted phylogenetic trees
We characterize the compatibility of a collection of unrooted phylogenetic trees as a question of determining whether a graph derived from these trees — the display graph — has a specific kind of triangulation, which we call legal. Our result is a counterpart to the well known triangulation-based characterization of the compatibility of undirected multi-state characters.
متن کاملFPT Algorithms for Binary Near-Perfect Phylogenetic Trees
We consider the problem of reconstructing near-perfect phylogenetic trees using binary character states (referred to as BNPP). A perfect phylogeny assumes that every character mutates at most once in the evolutionary tree, yielding an algorithm for binary character states that is computationally efficient but not robust to imperfections in real data. A near-perfect phylogeny relaxes the perfect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Biology
سال: 2017
ISSN: 0092-8240,1522-9602
DOI: 10.1007/s11538-017-0260-y